A Parallelization of Dijkstra ' s Shortest
نویسندگان
چکیده
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-eecient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel. We give a PRAM algorithm based on these criteria and analyze its performance on random digraphs with random edge weights uniformly distributed in 0;1]. We use the G(n;d=n) model: the graph consists of n nodes and each edge is chosen with probability d=n. Our PRAM algorithm needs O(n 1=3 log n) time and O(n log n+dn) work with high probability (whp). We also give extensions to external memory computation. Simulations show the applicability of our approach even on non-random graphs.
منابع مشابه
An Improved Dijkstra Shortest Path Algorithm
An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed to adapt to different network complexity. ...
متن کاملLow-Stretch Spanning Tree on Benchmark Circuits
We show the testing results of Kruskal, Prim-Dijkstra for finding a low-stretch spanning tree for both unweighted graphs and weighted graphs transformed from benchmark circuits [1]. On unweighted graph, our implementation can get an average stretch of about 7 for all benchmark circuits. Kruskal’s algorithm gives good edge selection for finding short stretch edges, but does not work well for oth...
متن کاملResearch on the Optimization and Simulation of the Shortest Path Based on Algorithm of Dijkstra
Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm, on account of the insufficiency of this algorithm in path optimization, this paper uses adjacency list and circular linked list with combination to store date, and through the improv...
متن کاملTraffic Network Optimal Scheduling Paths Based on Time Intervals Division
In order to make the network model was more fitting the actual condition of city traffic, this paper presents a dynamic transportation network model based on the traffic time division, and designs improved Dijkstra algorithm to solve the city traffic paths planning problem. Dijkstra algorithm is a typical singlesource shortest path algorithm is used to calculate a node to all other nodes in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998